Two-Dimensional Pattern Matching with Rotations
نویسندگان
چکیده
The problem of pattern matching with rotation is that of 2nding all occurrences of a twodimensional pattern in a text, in all possible rotations. We prove an upper and lower bound on the number of such di4erent possible rotated patterns. Subsequently, given an m × m array (pattern) and an n × n array (text) over some 2nite alphabet , we present a new method yielding an O(nm) time algorithm for this problem. c © 2003 Published by Elsevier B.V.
منابع مشابه
Faster Two Dimensional Pattern Matching with Rotations
The most efficient currently known algorithms for two dimensional pattern matching with rotations have a worst case time complexity of O(nm), where the size of the text is n × n and the size of the pattern is m × m. In this paper we present a new algorithm for the problem whose running time is O(nm).
متن کاملFast Filters for Two Dimensional String Matching Allowing Rotations
We give faster algorithms for searching a 2-dimensional pattern in a 2-dimensional text allowing rotations, mismatches and/or insertion/deletion errors.
متن کاملExact and Approximate Two Dimensional Pattern Matching allowing Rotations
We give fast ltering algorithms for searching a 2{dimensional pattern in a 2{dimensional text allowing any rotation of the pattern. We consider the cases of exact and approximate matching under several matching models, improving the previous results. For a text of size n n character and a pattern of size m m characters, the exact matching takes average time O(n 2 =m). If we allow k{mismatches o...
متن کاملNeighborhood matrix: A new idea in matching of two dimensional gel images
Automated data analysis and pattern recognition techniques are the requirements of biological and proteomicsresearch studies. The analysis of proteins consists of some stages among which the analysis of two dimensionalelectrophoresis (2-DE) images is crucial. The aim of image capturing is to generate a Photostat that can be used infuture works such as image comparison. The researchers introduce...
متن کاملRotation and Lighting Invariant Template Matching
We address the problem of searching for a two-dimensional pattern in a two-dimensional text (or image), such that the pattern can be found even if it appears rotated and brighter or darker than its occurrence. Furthermore, we consider approximate matching under several tolerance models. We obtain algorithms that are almost worst-case optimal. The complexities we obtain are very close to the bes...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Theor. Comput. Sci.
دوره 314 شماره
صفحات -
تاریخ انتشار 2003